A Logical Approach to CTL

نویسندگان

  • Gilles Dowek
  • Ying Jiang
چکیده

We introduce a notion of proof for CTL with respect to a given finite model and show some advantages of using such a notion. This also suggests to define a slight extension of CTL, called SCTL, where predicates can have an arbitrary arity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Logical Semantics for Agent Communication

In this paper we develop a semantics of our approach based on commitments and arguments for conversational agents. We propose a logical model based on CTL* (Extended Computation Tree Logic) and on dynamic logic. Called Commitment and Argument Network (CAN), our formal framework based on this hybrid approach uses three basic elements: social commitments, actions that agents apply to these commit...

متن کامل

An Action Based Framework for Verifying Logical and Behavioural Properties of Concurrent Systems

A system is described which supports proving both behavioural and logical properties of concurrent systems; these are specified by means of a process algebra and its associated logic. The logic is an action based version of the branching time logic CTL, which we call ACTL. It is interpreted over transition labelled structures while CTL is interpreted over state labelled ones. The core of the sy...

متن کامل

Paraconsistent Computation Tree Logic ∗ 1

It is known that paraconsistent logical systems are more appropriate for inconsistency-tolerant and uncertainty reasoning than other types of logical systems. In this paper, a paraconsistent computation tree logic, PCTL, is obtained by adding paraconsistent negation to the standard computation tree logic CTL. PCTL can be used to appropriately formalize inconsistency-tolerant temporal reasoning....

متن کامل

Paraconsistent Computation Tree Logic Paraconsistent Computation Tree Logic * 1

It is known that paraconsistent logical systems are more appropriate for inconsistency-tolerant and uncertainty reasoning than other types of logical systems. In this paper, a paraconsistent computation tree logic, PCTL, is obtained by adding paraconsistent negation to the standard computation tree logic CTL. PCTL can be used to appropriately formalize inconsistency-tolerant temporal reasoning....

متن کامل

Heart Reaction to Nandrolone Decanoate plus Two Different Intensities of Endurance Exercise: Electrocardiography and Stereological Approach

Background: Regarding the negative effects of androgenic anabolic steroids (AASs) abuse, the long-term effect of nandrolone decanoate with/without two intensities of endurance exercise training was investigated on heart tissue and electrocardiogram (ECG) in rats. Methods: The experiment was conducted on 63 male Wistar rats, which were 4 months old. The rats were divide into groups of control (C...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013